Parallelism Always Helps
نویسندگان
چکیده
منابع مشابه
Parallelism Always Helps
It is shown that every unit-cost random-access machine (RAM) that runs in time T can be simulated by a concurrent-read exclusive-write parallel random-access machine (CREW PRAM) in time O(T 1/2 log T ). The proof is constructive; thus it gives a mechanical way to translate any sequential algorithm designed to run on a unit-cost RAM into a parallel algorithm that runs on a CREW PRAM and obtain a...
متن کاملDerivational Parallelism and Ellipsis Parallelism
A central topic in work on ellipsis is the parallelism between missing VPs and their antecedents. There is evidence that parallelism is conditioned both syntactically and semantically. This has resulted in complex hybrid principles that regulate both syntactic structures and their interpretations (e.g., Fox 1995, 2000). We present an alternative, unified account based on parallelism of semantic...
متن کاملHardware parallelism vs. software parallelism
In this paper, we explore the rationale for multicore parallelism and instead argue that a better use of transistors is to use reconfigurable hardware cores. The difficulty in achieving software parallelism means that new ways of exploiting the silicon real estate need to be explored. Hardware implementations can often expose much finer grained parallelism than possible with software implementa...
متن کاملUbiquitous Commerce - Always On, Always Aware, Always Pro-active
The development of the infrastructure for ubiquitous computing is progressing rapidly, yet the applications that will be built on this new infrastructure remain largely ill defined. What will we do with these emerging capabilities? Stock quotes in 3-D on your heads-up display? Sports scores in stereo sound? We believe that the new kinds of services will result from three primary capabilities of...
متن کاملSpecificity Helps Text Classification
We examine the impact on classification effectiveness of semantic differences in categories. Specifically, we measure broadness and narrowness of categories in terms of their distance to the root of a hierarchically organized thesaurus. Using categories of four different levels degrees of broadness, we show that classifying documents into narrow categories gives better scores than classifying t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1997
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539794265402